Online Financial Algorithms Competitive Analysis

نویسندگان

  • Sandeep Kumar
  • Deepak Garg
چکیده

Analysis of algorithms with complete knowledge of its inputs is sometimes not up to our expectations. Many times we are surrounded with such scenarios where inputs are generated without any prior knowledge. Online Algorithms have found their applicability in broad areas of computer engineering. Among these, an online financial algorithm is one of the most important areas where lots of efforts have been used to produce an efficient algorithm. In this paper various “Online Algorithms” have been reviewed for their efficiency and various alternative measures have been explored for analysis purposes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Can online trading algorithms beat the market? An experimental evaluation

From experimental evaluation, we reasonably infer that online trading algorithms can beat the market. We consider the scenario of trading in financial market and present an extensive experimental study to answer the question “Can online trading algorithms beat the market?”. We evaluate the selected set of online trading algorithms on DAX30 and measure the performance against buy-and-hold strate...

متن کامل

Online Scheduling of Jobs for D-benevolent instances On Identical Machines

We consider online scheduling of jobs with specic release time on m identical machines. Each job has a weight and a size; the goal is maximizing total weight of completed jobs. At release time of a job it must immediately be scheduled on a machine or it will be rejected. It is also allowed during execution of a job to preempt it; however, it will be lost and only weight of completed jobs contri...

متن کامل

Competitive Analysis of Distributed Algorithms

Most applications of competitive analysis have involved on-line problems where a candidate on-line algorithm must compete on some input sequence against an optimal oo-line algorithm that can in eeect predict future inputs. EEorts to apply competitive analysis to fault-tolerant distributed algorithms require accounting for not only this input nondeterminism but also system nondeterminism that ar...

متن کامل

Assessment of the Factors Affecting the Acceptance of Online Banking by Consumers with an Emphasis on the Aspect of Risk (Case Study: Customers of Refah Bank in Qazvin Province of Iran)

Nowadays, internet technology provides an opportunity for banks and financial institutions to take advantages in dynamic and competitive turbulent environment in their favor. In addition, considering the importance and status of internet banking and growing trend of it in the country in recent years, now banks and financial institutions have found that maintaining status and effective developme...

متن کامل

Competitive Online Algorithms

Overview Over the past ten years, online algorithms have received considerable research interest. Online problems had been investigated already in the seventies and early eighties but an extensive, systematic study only started when Sleator and Tarjan (1985) suggested comparing an online algorithm to an optimal ooine algorithm and Karlin, Manasse, Rudolph and Sleator (1988) coined the term comp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1209.6489  شماره 

صفحات  -

تاریخ انتشار 2012